A Note On Covering Radius Of Macdonald Codes
نویسندگان
چکیده
In this paper we determine an upper bound for the covering radius of a q-ary MacDonald codeCk;u(q). Values of nq(4; d), the minimal length of a 4-dimensional q-ary code with minimum distance d is obtained for d = q 1 and q 2. These are used to determine the covering radius of C3;1(q),C3;2(q) and C4;2(q).
منابع مشابه
International Journal of Mathematics And its Applications On Covering Radius of Codes Over R = Z 2 + u Z 2 , where u 2 = 0 Using Bachoc Distance
In this paper, we give lower and upper bounds on the covering radius of codes over the ring R = Z2 + uZ2, where u2 = 0 with bachoc distance and also obtain the covering radius of various Repetition codes, Simplex codes of α-Type code and β-Type code. We give bounds on the covering radius for MacDonald codes of both types over R = Z2 + uZ2. MSC: 20C05, 20C07, 94A05, 94A24.
متن کاملOn the Covering Radius of Codes over Z4 with Chinese Euclidean Weight
In this paper, we give lower and upper bounds on the covering radius of codes over the ring Z4 with respect to chinese euclidean distance. We also determine the covering radius of various Repetition codes, Simplex codes Type α and Type β and give bounds on the covering radius for MacDonald codes of both types over Z4.
متن کاملOn the covering radius of some modular codes
This paper gives lower and upper bounds on the covering radius of codes over Z2s with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type α and Type β) and their dual and give bounds on the covering radii for MacDonald codes of both types over Z4.
متن کاملOn Some Classes of $\mathbb{Z}_{2}\mathbb{Z}_{4}-$Linear Codes and their Covering Radius
In this paper we define Z2Z4−Simplex and MacDonald Codes of type α and β and we give the covering radius of these codes.
متن کاملOn octonary codes and their covering radii
This paper introduces new reduction and torsion codes for an octonary code and determines their basic properties. These could be useful for the classification of self-orthogonal and self dual codes over Z8. We also focus our attention on covering radius problem of octonary codes. In particular, we determine lower and upper bounds of the covering radius of several classes of Repetition codes, Si...
متن کامل